An evolutionary algorithm for multicriteria path optimization problems
نویسندگان
چکیده
منابع مشابه
An Efficient Conjugate Gradient Algorithm for Unconstrained Optimization Problems
In this paper, an efficient conjugate gradient method for unconstrained optimization is introduced. Parameters of the method are obtained by solving an optimization problem, and using a variant of the modified secant condition. The new conjugate gradient parameter benefits from function information as well as gradient information in each iteration. The proposed method has global convergence und...
متن کاملAn Adaptive Quantum Evolutionary Algorithm for Engineering Optimization Problems
Real world problems in engineering domain are typically constraint optimization problems. An Adaptive Quantum Evolutionary Algorithm for solving such problems is proposed in this paper. The proposed technique uses a novel qubits representation for search and optimization and uses feasibility rules for handling constraints. Moreover, it does not need stochastic ranking or niching or other method...
متن کاملIsogeometric Topology Optimization of Continuum Structures using an Evolutionary Algorithm
Topology optimization has been an interesting area of research in recent years. The main focus of this paper is to use an evolutionary swarm intelligence algorithm to perform Isogeometric Topology optimization of continuum structures. A two-dimensional plate is analyzed statically and the nodal displacements are calculated. The nodal displacements using Isogeometric analysis are found to be ...
متن کاملAn Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating the solution set of a multiobjective programming problem, where the objective functions involved are arbitary convex functions and the set of feasible points is convex. The method is based on generating warm-start point...
متن کاملApproximation Algorithms for Combinatorial Multicriteria Optimization Problems
The computational complexity of combinatorial multiple objective programming problems is investigated. INP-completeness and #P-completeness results are presented. Using two deenitions of approximability, general results are presented, which outline limits for approximation algorithms. The performance of the well known tree and Christoodes' heuristics for the TSP is investigated in the multicrit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Geographical Information Science
سال: 2006
ISSN: 1365-8816,1362-3087
DOI: 10.1080/13658810600607766